machine code

<language> (Originally "CAML" - Categorical Abstract Machine Language) A version of ML by G. Huet, G. Cousineau, Ascander Suarez, Pierre Weis, Michel Mauny and others of INRIA and ENS. CAML is intermediate between LCF ML and SML [in what sense?]. It has first-class functions, {static type inference} with polymorphic types, user-defined {variant types} and product types, and pattern matching. It is built on a proprietary run-time system. The CAML V3.1 implementation added lazy and mutable data structures, a "grammar" mechanism for interfacing with the Yacc parser generator, pretty-printing tools, high-performance arbitrary-precision arithmetic, and a complete library. CAML V3 is often nicknamed "heavy CAML", because of its heavy memory and CPU requirements compared to Caml Light. in 1990 Xavier Leroy and Damien Doligez designed a new implementation called Caml Light, freeing the previous implementation from too many experimental high-level features, and more importantly, from the old Le_Lisp back-end. Following the addition of a native-code compiler and a powerful module system in 1995 and of the object and class layer in 1996, the project's name was changed to Objective Caml. ["The CAML Reference Manual", P. Weis et al, TR INRIA-ENS, 1989]. (2003-04-12)

The representation of a computer program which is actually read and interpreted by the computer. A program in machine code consists of a sequence of machine instructions (possibly interspersed with data). Instructions are binary strings which may be either all the same size (e.g. one 32-bit word for many modern RISC microprocessors) or of different sizes, in which case the size of the instruction is determined from the first word (e.g. Motorola 68000) or byte (e.g. Inmos transputer). The collection of all possible instructions for a particular computer is known as its "instruction set". Execution of machine code may either be hard-wired into the central processing unit or it may be controlled by microcode. The basic execution cycle consists of fetching the next instruction from main memory, decoding it (determining which operation it specifies and the location of any arguments) and executing it by opening various gates (e.g. to allow data to flow from main memory into a CPU register) and enabling functional units (e.g. signalling to the ALU to perform an addition). Humans almost never write programs directly in machine code. Instead, they use a programming language which is translated by the computer into machine code. The simplest kind of programming language is assembly language which usually has a one-to-one correspondence with the resulting machine code instructions but allows the use of mnemonics (ASCII strings) for the "op codes" (the part of the instruction which encodes the basic type of operation to perform) and names for locations in the program (branch labels) and for variables and constants. (1995-02-15)

In computer programming, machine code is any low-level programming language, consisting of machine language instructions, which are used to control a computer's central processing unit (CPU). Each instruction causes the CPU to perform a very specific task, such as a load, a store, a jump, or an arithmetic logic unit (ALU) operation on one or more units of data in the CPU's registers or memory.

A man–machine language (MML) is a specification language. MML typically are defined to standardize the interfaces for managing a telecommunications or network device from a console.

Abstract State Machine Language (AsmL) is a programming language based on the Abstract State Machines

Machine to machine (M2M) is direct communication between devices using any communications channel, including wired and wireless.

Animal machine or bête-machine (Fr., animal-machine), is a philosophical notion from Descartes in the 17th century who held that animal behaviour can be compared to the one of machines.